Hausdorff dimension in graph directed constructions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hausdorff dimension and oracle constructions

Bennett and Gill (1981) proved that P 6= NP relative to a random oracle A, or in other words, that the set O[P=NP] = {A | P = NP} has Lebesgue measure 0. In contrast, we show that O[P=NP] has Hausdorff dimension 1. This follows from a much more general theorem: if there is a relativizable and paddable oracle construction for a complexity-theoretic statement Φ, then the set of oracles relative t...

متن کامل

The Hausdorff dimension of some snowflake-like recursive constructions

Fractal subsets of Rn with highly regular structure are often constructed as a limit of a recursive procedure based on contractive maps. The Hausdorff dimension of recursively constructed fractals is relatively easy to find when the contractive maps associated with each recursive step satisfy the Open Set Condition (OSC). We present a class of random recursive constructions which resemble snowf...

متن کامل

Real Analyticity of Hausdorff Dimension for Higher Dimensional Hyperbolic Graph Directed Markov Systems

In this paper we prove that the Hausdorff dimension function of the limit sets of strongly regular, hyperbolic, conformal graph directed Markov systems living in higher dimensional Euclidean spaces R, d ≥ 3, and with an underlying finitely irreducible incidence matrix is real-analytic.

متن کامل

Real Analyticity of Hausdorff Dimension for Higher Dimensional Graph Directed Markov Systems

In this paper we prove that the Hausdorff dimension function of the limit sets of strongly regular, countable, conformal graph directed Markov systems living in higher dimensional Euclidean spaces R, d ≥ 3, and with an underlying finitely irreducible incidence matrix is real-analytic.

متن کامل

Contraction Ratios for Graph-directed Iterated Constructions

We provide necessary and sufficient conditions for a graph-directed iterated function system to be strictly contracting.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1988

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1988-0961615-4